The swap matching problem revisited
نویسندگان
چکیده
In this paper, we revisit the much studied problem of Pattern Matching with Swaps (Swap Matching problem, for short). We first present a graph-theoretic model, which opens a new and so far unexplored avenue to solve the problem. Then, using the model, we devise two efficient algorithms to solve the swap matching problem. The resulting algorithms are adaptations of the classic shift-and algorithm. For patterns having length similar to the word-size of the target machine, both the algorithms run in linear time considering a fixed alphabet.
منابع مشابه
A Simpler Bit-parallel Algorithm for Swap Matching
The pattern matching problem with swaps is to find all occurrences of a pattern in a text while allowing the pattern to swap adjacent symbols. The goal is to design fast matching algorithm that takes advantage of the bit parallelism of bitwise machine instructions. We point out a fatal flaw in the algorithm proposed by Ahmed et al. [The swap matching problem revisited, Theor. Comp. Sci. 2014], ...
متن کاملA New Model to Solve the Swap Matching Problem and Efficient Algorithms for Short Patterns
In this paper, we revisit the much studied problem of Pattern matching with Swaps (Swap Matching problem, for short). We first present a new graph-theoretic approach to model the problem, which opens a new and so far unexplored avenue to solve the problem. Then, using the model, we devise an efficient algorithm to solve the swap matching problem. The resulting algorithm is an adaptation of the ...
متن کاملAn Efficient Algorithm for Approximate Pattern Matching with Swaps
The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T , when disjoint local swaps in the pattern are allowed. In the Approximate Pattern Matching problem with Swaps one seeks to compute, for every text location with a swapped match of P , the number of swaps necessary to obtain a match at the location. In this paper, we present new efficient algo...
متن کاملImplementation of a Swap Matching Algorithm Using a Graph Theoretic Model
The swap matching problem consists if finding a pattern in a text, while allowing for transpositions in the pattern. A new approach using a graph-theoretic model was presented in [6] by Iliopoulos et al. In this paper we present a useful application for this algorithm and provide an analysis of its running time with a naive approach through implementation.
متن کاملA New Algorithm for Efficient Pattern Matching with Swaps
The Pattern Matching problem with Swaps consists in finding all occurrences of a pattern P in a text T , when disjoint local swaps in the pattern are allowed. In this paper, we present a new efficient algorithm for the Swap Matching problem with short patterns. In particular, we devise a O(nm) general algorithm, named Backward-Cross-Sampling, and show an efficient implementation of it, based on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 557 شماره
صفحات -
تاریخ انتشار 2014